Movement detection method and device with a thresholding algorithm per envelope

ABSTRACT

A movement detection method that includes calculating a first mean of a signal designed to be supplied by at least one pixel of a pixel matrix which corresponds to a captured image. The movement detection method further includes calculating a second signal, second mean, third mean and fourth mean wherein a movement is detected from the result of at least one comparison made of the signal and the second, third and fourth mean.

TECHNICAL FIELD

This document relates to the field of movement detection and more particularly that of image sensors, such as CMOS imaging devices used in the visible or infrared range, wherein a movement detection method is used.

STATE OF THE PRIOR ART

Movement detection involves detecting the movement of moving elements with respect to fixed elements in a field of captured images. These elements may be for example vehicles or even people. Such movement detection consists of isolating, among the signals supplied by an image sensor, those related to the moving elements, for example by detecting the significant variations on the mean or variance of a signal of a pixel or a group of pixels indicating a change in the nature of the element captured in this pixel or group of pixels, with respect to those related to the fixed elements of which the mean or variance remains for example substantially constant in time. For this purpose, detection methods or algorithms are used.

A first approach consists of using a “recursive average” algorithm for such movement detection. This algorithm is based on an estimated background calculation, which is to say of the fixed elements found in all of the captured images. Which is to say X_(n) is the background, or the mean, corresponding to an image n, S_(n) is the signal corresponding to the acquired image n and 1/N is a weighting coefficient, therefore:

$X_{n} = {X_{n - 1} - {\frac{1}{N}X_{n - 1}} + {\frac{1}{N}S_{n}}}$

A comparison is then made between a chosen threshold value T_(h) and |S_(n)−X_(n)|. If the value obtained is positive, this means that a movement has been detected. X_(n) and S_(n) may be variables obtained from a signal supplied by a pixel or by considering several signals supplied by several pixels, for example a group of pixels located next to one another that form a macropixel, like a single signal, taking for example the mean of these signals.

Such an algorithm has especially as disadvantage a lack of robustness in the detection as the detection threshold T_(h) is determined à priori, prior to the algorithm being used, and is global for all of the pixels of the matrix. This disadvantage results in low precision of the location of the movements in the captured images. The low pass type filtering carried out by this algorithm induces dephasing, and consequently a delay in the response with respect to the signal. This delay results in a “drag effect” when the moving elements detected are shown, which is to say that the signals supplied by the pixels which no longer capture part of a moving element are still considered as signals which represent part of the moving element.

A second approach consists of using a “sigma-delta” algorithm for the movement detection. This algorithm permits significant variations of the signal to be detected by calculating two variables that can be assimilated to the mean value and the variance of the signal. FIG. 1 is a diagrammatical representation of a movement detection device using a sigma-delta algorithm.

Firstly, the sigma-delta mean M1 _(n) is calculated, with a constant incrementation and decrementation value, for example 1, of the signal S_(n) corresponding to the acquired image n. For this purpose, the signal S_(n) is sent as an input of the first means of calculating the sigma-delta mean 2. These means 2 first carry out an initialisation M1 ₀=S₀. For the following images, which is to say for n>0, these means 2 compare M1 _(n-1) and S_(n). If M1 _(n-1)<S_(n), then the value of M1 _(n-1) is incremented such that M1 _(n)=M1 _(n-1)+1. If M1 _(n-1)>S_(n), then the value of M1 _(n-1) is decremented such that M1 _(n)=M1 _(n-1)−1. The value of the signal Δ_(n)=|M1 _(n)−S_(n)| is calculated by a subtractor 4 and absolute value calculation means 6. The calculation of N×Δn is then made by the multiplier 8, wherein N is a constant corresponding to the adaptive threshold of the algorithm whose value is chosen in function of the complexity of the scene. The calculation of a sigma-delta mean M2 _(n) of N·Δn is then made and sent as an input of second means of calculating the sigma-delta mean 10. Next, the initialisation M2 ₀=0 is carried out first. For the following images, which is to say for n>0, a comparison is made of M2 _(n-1) and N·Δ_(n). If M2 _(n-1)<N·Δ_(n), then the value of M2 _(n-1) is incremented such that M2 _(n)=M2 _(n-1)+1. If M2 _(n-1)>N·Δ_(n), then the value of M2 _(n-1) is decremented such that M2 _(n)=M2 _(n-1)−1. Finally, a comparison is made by a comparator 12 of the signal Δ_(n) and M2 _(n). If M2 _(n)<Δ_(n), this means that a movement has been detected.

As for the recursive average algorithm, the variables S_(n), M1 _(n), Δ_(n) and M2 _(n) may be obtained from a signal supplied by a pixel or by considering several signals supplied by several pixels, for example a group of pixels next to one another, like a single signal, taking for example the mean of these signals.

However, such an algorithm especially has the disadvantage of not filtering high frequency parasite movements which are considered as movements to be detected (for example, a movement of the leaves of a tree or snow falling). Furthermore, the constant N used must be determined à priori, which reduces the adaptability of the detection carried out by this algorithm.

DESCRIPTION OF THE INVENTION

Thus there is a need to propose a method of movement detection which permits the detection of high frequency parasite movements to be reduced or eliminated and which offers more efficient detection, for example in terms of precision of locating the movements, with respect to the methods of the prior art, and which reduces or eliminates the “drag” effect obtained by the methods of the prior art.

Also, there is a need to propose a method of movement detection which requires few calculation and memory hardware resources to be used, and that can be installed analogically in a very low consumption imaging device (with for example a mean consumption equal to approximately several hundred μW).

For this purpose, one embodiment proposes a method of movement detection comprising at least the following steps:

-   -   the calculation of a first mean M1 _(n) of a signal S_(n)         designed to be supplied by at least one pixel of a pixel matrix         which corresponds to an n-th captured image, in function of the         value of the signal S_(n) and/or a previous value M1 _(n-1);     -   the calculation of a signal Δ_(n)=|M1 _(n)−S_(n)|;     -   the calculation of a second mean M2 _(n) of the signal Δ_(n) in         function of the value of a previous value M2 _(n-1) and/or the         value of the signal Δ_(n);     -   the calculation of a third mean M3 _(n) of the signal         (S_(n)−k₁·M2 _(n)) in function of a previous value M3 _(n-1)         and/or the value of the signal (S_(n)−k₁·M2 _(n));     -   the calculation of a fourth mean M4 _(n) of the signal         (S_(n)+k₂·M2 _(n)) in function of a previous value M4 _(n-1)         and/or the value of the signal (S_(n)+k₂·M2 _(n));

wherein a movement is considered as detected from the result of at least one comparison made on the signals S_(n), (M3 _(n)−M2 _(n)) and (M4 _(n)+M2 _(n));

where n: natural whole number;

and k₁ and k₂: non-null positive real numbers.

Consequently, the significant variations of the signal emitted by a pixel or a macropixel may be detected by “thresholding” the variations of the signal by the envelope of the signal S_(n) itself, which is to say by defining adaptive upper and lower threshold values for the movement detection depending on the activity of the captured signal S_(n). Moreover, this thresholding can keep the sign of the emitted signal derivative, which it is not possible with a thresholding realized on the absolute value of the difference between the emitted signal and an estimated background.

The adaptability of the detection is also improved by eliminating certain constants that had to determined à priori in the methods of the prior art. The sensitivity of the detection is also adapted locally to the activity of the pixels, which is to say individually for each pixel.

The coefficients k₁ and k₂ allow a direct adaptation of the upper and lower threshold values depending on the disturbance level in the analyzed images. These coefficients allow an expansion or a reduction of the envelope defined by the detection threshold around S_(n). For example, it is possible to impose “harder” threshold detection conditions with an expansion of the envelope, thus enables to escape some noise disturbances during movement detection. The values of k₁ and k₂ may be chosen in function of the environment in which the movement detection is realized, that is in function of the ambient “agitation” in the analyzed images. In an urban environment, the values of k₁ and k₂ may be equals to 1. Preferably, the values of k₁ and/or k₂ may be comprised between 0 and 3. Moreover, the values of k₁ and k₂ may be similar or not, depending on whether a symmetrical or an unsymmetrical envelope is needed, in function of disturbances that are not to be detected as movements.

The first mean M1 _(n) may be obtained from the following equation:

${{M\; 1_{n}} = {{M\; 1_{n - 1}} - {\frac{1}{N_{1}}M\; 1_{n - 1}} + {\frac{1}{N_{1}}S_{n}}}},$

where M1 ⁻¹=0, and

1/N₁: non-null positive real number.

By choosing an appropriate value of 1/N₁, the time constant of the calculation of this first mean may be chosen, which may be slow to estimate the background of the images captured.

In one variant, the first mean M1 _(n) may be obtained at least by the following calculation steps:

-   -   M1 ₀=S₀;

and for n>0:

-   -   M1 _(n)=M1 _(n-1)+c₁ when M1 _(n-1)<S_(n);     -   M1 _(n)=M1 _(n-1)−c₁ when M1 _(n-1)>S_(n);

Where c₁: non-null positive real number.

The second mean M2 _(n) may be obtained from the following equation:

${{M\; 2_{n}} = {{M\; 2_{n - 1}} - {\frac{1}{N_{2}}M\; 2_{n - 1}} + {\frac{1}{N_{2}}\Delta_{n}}}},$

where M2 ⁻¹=0, et

1/N₂: non-null positive real number.

The second mean M2 _(n) may be also obtained at least by the following calculation steps:

-   -   M2 ₀=Δ₀;

and for n>0:

-   -   M2 _(n)=M2 _(n-1)+c₂ when M2 _(n-1)<Δ_(n);     -   M2 _(n)=M2 _(n-1)−c₂ when M2 _(n-1)>Δ_(n);

where c₂: non-null positive real number.

The third mean M3 _(n) may be obtained from the following equation:

${{M\; 3_{n}} = {{M\; 3_{n - 1}} - {\frac{1}{N_{3}}M\; 3_{n - 1}} + {\frac{1}{N_{3}}\left( {S_{n} - {k_{1}M\; 2_{n}}} \right)}}},$

Where M3 ⁻¹=0, and

1/N₃: non-null positive real number.

In this case, the value of 1/N₃ may be adjusted in function of the value |M3 _(n)−S_(n)|.

The third mean M3 _(n) may be obtained at least by the following calculation steps:

-   -   M3 ₀=(S₀−k₁·M2 ₀);

and for n>0:

-   -   M3 _(n)=M3 _(n-1)+c₃ when M3 _(n-1)<(S_(n)−k₁·M2 _(n));     -   M3 _(n)=M3 _(n-1)−c₃ when M3 _(n-1)>(S_(n)−k₁·M2 _(n));

where c₃: non-null positive real number.

The fourth mean M4 _(n) may be obtained from the following equation:

${{M\; 4_{n}} = {{M\; 4_{n - 1}} - {\frac{1}{N_{4}}M\; 4_{n - 1}} + {\frac{1}{N_{4}}\left( {S_{n} + {k_{2}M\; 2_{n}}} \right)}}},$

where M4 ⁻¹=0, and

1/N₄: non-null positive real number.

In this case, the value of 1/N₄ may be adjusted in function of the value |M4 _(n)−S_(n)|.

An asymmetry of the thresholding envelope may be realised by the choice of the values of time constants 1/N₃ and 1/N₄ which may be dynamically adapted during the method.

For example, when M4 _(n)<S_(n), N₄ may be small, which corresponds to a short time constant τ, for example lower than about 0.5 second (for example equal to 380 ms). When M4 _(n)>S_(n), N₄ may be high, which corresponds to a long time constant τ, for example higher than about 1 second (for example equal to 1.18 s), at a sampling period equal to 25 Hz. The time constant τ of a mean may be equal to the ratio: sampling period of the image capture/ln(1−1/N)⁻¹, the sampling period corresponding to the period of the signal S_(n) period (noted period (S_(n))). Thus, when M4 _(n)<S_(n), the value of 1/N₄ may verify the relation:

period (S_(n))/ln(1−1/N₄)−¹<0.5 s;

and when M4 _(n)>S_(n), the value of 1/N₄ may verify the relation:

period (S_(n))/ln(1−1/N₄)⁻¹>1 s.

Moreover, when M3 _(n)<S_(n), N₃ may be high, which corresponds to a long time constant τ, for example higher than about 1 second, and when M3 _(n)>S_(n), N₃ may be small, which corresponds to a short time constant τ, for example smaller than about 0.5 second. Thus, when M3 _(n)<S_(n), the value of 1/N₃ may verify the relation:

period (S_(n))/ln(1−1/N₃)−¹>1 s;

and when M3 _(n)>S_(n), the value of 1/N₃ may verify the relation:

period (S_(n))/ln(1−1/N₃)⁻¹<0.5 s.

A short time constant may be equal to about 380 ms, and a long time constant may be equal to about 1.18 s. The time constants are here considered at a sampling period of 25 Hz.

Thus, an unsymmetrical thresholding envelope allows adapting the thresholding of positive variations of the signal (comparison of S_(n) and M4 _(n)) and the thresholding of negative variations of the signal (comparison of S_(n) and M3 _(n)). For example, it is possible to realize a filtering of a camera blooming with repeated flashes by imposing “harder” threshold detection conditions on the variations (for example positive in the case of a grey-levels scene and white flashes corresponding to a maximum value of the output signal) induced by flashes et keeping a suitable sensitivity on negatives variations induces by the other darker objects.

The fourth mean M4 _(n) may be obtained at least by the following calculation steps:

-   -   M4 ₀=(S₀+k₂·M2 ₀);

and for n>0:

-   -   M4 _(n)=M4 _(n-1)+c₄ when M4 _(n-1)<(S_(n)+k₂·M2 _(n));     -   M4 _(n)=M4 _(n-1)−c₄ when M4 _(n-1)>(S_(n)+k₂·M2 _(n));

where c₄: non-null positive real number.

The value of the first mean M1 _(n) and/or the second mean M2 _(n) and/or the third mean M3 _(n) and/or the fourth mean M4 _(n) may be respectively greater than a first non-null minimum threshold value S_(M1n) and/or a second non-null minimum threshold value S_(M2n) and/or a third non-null minimum threshold value S_(M3n) and/or a fourth non-null minimum threshold value S_(M4n).

These threshold values may be comprised between approximately 1/250×the dynamic of the signal S_(n) and 1/25×the dynamic of the signal S_(n), and for example equal to approximately 1/50×the dynamic of the signal S_(n), the dynamic of the signal S_(n) corresponding to the possible maximum value of |S_(n)| (for example equal to 256 for a 8 bits coded signal).

The comparison may be made between the signals S_(n) and (M3 _(n)−M2 _(n)) and between the signals S_(n) and (M4 _(n)+M2 _(n)), wherein a movement is considered as detected when S_(n)>(M4 _(n)+M2 _(n)) or S_(n)<(M3 _(n)−M2 _(n)).

In one variant, the method may further comprise, between the calculation step of the fourth mean M4 _(n) of the signal (S_(n)+k₂·M2 _(n)) and the comparison step, a calculation step of a fifth mean M5 _(n) of the signal S_(n) in function of a previous value M5 _(n-1) and/or the value of the signal S_(n), wherein said comparison may be made between the signals M5 _(n) and (M3 _(n)−M2 _(n)) and between the signals M5 _(n) and (M4 _(n)+M2 _(n)), wherein a movement is considered as detected when M5 _(n)>(M4 _(n)+M2 _(n)) or M5 _(n)<(M3 _(n)−M2 _(n)).

In this case, band pass filtering may be generated to eliminate the high frequency parasite movements, as well as the “drag” effect observed in the movement detection methods of the prior art.

The fifth mean M5 _(n) may be obtained from the following equation:

${{M\; 5_{n}} = {{M\; 5_{n - 1}} - {\frac{1}{N_{5}}M\; 5_{n - 1}} + {\frac{1}{N_{5}}S_{n}}}},$

where M5 ⁻¹=0, and

1/N₅: non-null positive real number.

In this case, the high frequency parasites of the signal are filtered even more efficiently.

The values of the weighting coefficients 1/N, and the values of the incrementation and decrementation coefficients c in the case of a calculation of a sigma-delta type mean, may be calculated in function of the speed of acquisition of the images, and may be easily determined.

The values of the weighting coefficients 1/N which may be used for the calculation of means M1 _(n) and/or M2 _(n) may be chosen such that the time constants τ of these means are long, for example higher than about 1 second.

The values of the incrementation and decrementation coefficients c which may be used for the calculation of means M1 _(n) and/or M2 _(n) and/or M3 _(n) and/or M4 _(n) may be chosen and adapted during the method in order to satisfy the relation c<|dS_(n)/dn|. In one variant, when the incrementation and decrementation coefficients have fixed values, for example equal to 1, it is possible to adapt a refresh period Tn of the method, that is the period of which the steps of the method are realized, in order to satisfy the relation c<|ΔS_(n)/Tn|.

Another embodiment also relates to a movement detection device comprising at least:

-   -   means of calculating, or a calculator of, a first mean M1 _(n)         of a signal S_(n) designed to be supplied by at least one pixel         of a pixel matrix and corresponding to a n-th captured image, in         function of the value of the signal S_(n) and/or a previous         value M1 _(n-1);     -   means of calculating, or a calculator of, a signal Δ_(n)=|M1         _(n)−S_(n)|;     -   means of calculating, or a calculator of, a second mean M2 _(n)         of the signal Δ_(n) in function of a previous value M2 _(n-1)         and/or the value of the signal Δ_(n);     -   means of calculating, or a calculator of, a third mean M3 _(n)         of the signal (S_(n)−k₁·M2 _(n)) in function of a previous value         M3 _(n-1) and/or the value of the signal (S_(n)−k₁·M2 _(n));     -   means of calculating, or a calculator of, a fourth mean M4 _(n)         of the signal (S_(n)+k₂·M2 _(n)) in function of a previous value         M4 _(n-1) and/or the value of the signal (S_(n)+k₂·M2 _(n));

a movement is considered as detected from the result at the output of the means of comparison, or a comparator, making at least one comparison of the signals S_(n), (M3 _(n)−M2 _(n)) and (M4 _(n)+M2 _(n));

where n: natural whole number;

and k₁ and k₂: non-null positive real numbers.

The means of calculating, or the calculator of, the first mean M1 _(n) may carry out at least the following operation:

${{M\; 1_{n}} = {{M\; 1_{n - 1}} - {\frac{1}{N_{1}}M\; 1_{n - 1}} + {\frac{1}{N_{1}}S_{n}}}},$

where M1 ⁻¹=0, and

1/N₁: non-null positive real number.

The means of calculating, or the calculator of, the first mean M1 _(n) may at least comprise:

-   -   means of initialising the value of M1 ₀ to the value of S₀;     -   means of comparing, or a comparator of, the value of the signal         M1 _(n-1) and the value of the signal S_(n);     -   means of incrementing and decrementing the value of M1 _(n) by a         constant c₁, where c₁: non-null positive real number.

The means of calculating, or the calculator of, the second mean M2 _(n) may carry out at least the following operation:

${{M\; 2_{n}} = {{M\; 2_{n - 1}} - {\frac{1}{N_{2}}M\; 2_{n - 1}} + {\frac{1}{N_{2}}\Delta_{n}}}},$

where M2 ⁻¹=0, and

1/N₂: non-null positive real number.

The means of calculating, or the calculator of, the second mean M2 _(n) may at least comprise:

-   -   means of initialising the value of M2 ₀ to the value of Δ₀;     -   means of comparing, or a comparator of, the value of the signal         M2 _(n-1) and the value of the signal Δ_(n);     -   means of incrementing and decrementing the value of M2 _(n) by a         constant c₂, where c₂: non-null positive real number.

The means of calculating, or the calculator of, the third mean M3 _(n) may carry out at least the following operation:

${{M\; 3_{n}} = {{M\; 3_{n - 1}} - {\frac{1}{N_{3}}M\; 3_{n - 1}} + {\frac{1}{N_{3}}\left( {S_{n} - {k_{1}M\; 2_{n}}} \right)}}},$

where M3 ⁻¹=0, and

1/N₃: non-null positive real number.

In this case, the means of calculating, or the calculator of, the third mean M3 _(n) may further comprise means of adjusting the value of 1/N₃ in function of the value |M3 _(n)−S_(n)| such that:

-   -   when M3 _(n)<S_(n), the value of 1/N₃ verify the relation:         period (S_(n))/ln(1−1/N₃)−¹>1 s;

and when M3 _(n)>S_(n), the value of 1/N₃ verify the relation: period (S_(n))/ln(1−1/N₃)⁻¹<0.5 s.

The means of calculating, or the calculator of, the third mean M3 _(n) at least comprise:

-   -   means of initialising the value of M3 ₀ to the value of         (S₀−k₁·M2 ₀);     -   means of comparing, or a comparator of, the value of the signal         M3 _(n-1) and the value of the signal (S_(n)−k₁·M2 _(n));     -   means of incrementing and decrementing the value of M3 _(n) by a         constant c₃, where c₃: non-null positive real number.

The means of calculating, or the calculator of, the fourth mean M4 _(n) may carry out at least the following operation:

${{M\; 4_{n}} = {{M\; 4_{n - 1}} - {\frac{1}{N_{4}}M\; 4_{n - 1}} + {\frac{1}{N_{4}}\left( {S_{n} + {{k_{2} \cdot M}\; 2_{n}}} \right)}}},$

where M4 ⁻¹=0, and

1/N₄: non-null positive real number.

In this case, the means of calculating, or the calculator of, the fourth mean M4 _(n) may further comprise means of adjusting the value of 1/N₄ in function of the value |M4 _(n)−S_(n)| such that:

-   -   when M4 _(n)<S_(n)| the value of 1/N₄ verify the relation:         period (S_(n))/ln(1−1/N₄)−¹<0.5 s;

and when M4 _(n)>S_(n), the value of 1/N₄ verify the relation: period (S_(n))/ln(1−1/N₄)⁻¹>1 s.

The means of calculating, or the calculator of, the fourth mean M4 _(n) may at least comprise:

-   -   means of initialising the value of M4 ₀ to the value of         (S₀+k₂·M2 ₀);     -   means of comparing, or a comparator of, the value of the signal         M4 _(n-1) and the value of the signal (S_(n)+k₂·M2 _(n));     -   means of incrementing and decrementing the value of M4 _(n) by a         constant c₄, where c₄: non-null positive real number.

The means of comparison, or the comparator, may be means of comparing, or a comparator of, the signals S_(n) and (M3 _(n)−M2 _(n)) and means of comparing, or a comparator of, the signals S_(n) and (M4 _(n)+M2 _(n)), wherein a movement may be considered as detected when S_(n)>(M4 _(n)+M2 _(n)) or S_(n)<(M3 _(n)−M2 _(n)).

The device may further comprise means of calculating, or a calculator of, a fifth mean M5 _(n) of the signal S_(n) in function of a previous value M5 _(n-1) and/or the value of the signal S_(n), wherein the means of comparison, or the comparator, may be means of comparing, or a comparator of, the signals M5 _(n) and (M3 _(n)−M2 _(n)) and means of comparing, or a comparator of, the signals M5 _(n) and (M4 _(n)+M2 _(n)), wherein a movement is considered as detected when M5 _(n)>(M4 _(n)+M2 _(n)) or M5 _(n)<(M3 _(n)−M2 _(n)).

In this case, the means of calculating, or the calculator of, the fifth mean M5 _(n) may carry out at least the following operation:

${{M\; 5_{n}} = {{M\; 5_{n - 1}} - {\frac{1}{N_{5}}M\; 5_{n - 1}} + {\frac{1}{N_{5}}S_{n}}}},$

where M5 ⁻¹=0, and

1/N₅: non-null positive real number.

The means of comparison, or the comparator, may at least comprise an operational amplifier, or transconductance amplifier.

Finally, this invention also relates to an image capture device comprising at least one pixel matrix and one movement detection device as previously described.

BRIEF DESCRIPTION OF THE DRAWINGS

This invention will be more clearly understood upon reading the following description of embodiments provided purely by way of illustration and in no way restrictively, in reference to the appended drawings in which:

FIG. 1 shows diagrammatically a sigma-delta algorithm movement detection device,

FIG. 2 shows diagrammatically a movement detection device with a thresholding algorithm per envelope,

FIG. 3 shows signals obtained during the implantation of a movement detection method with a thresholding algorithm per envelope,

FIG. 4 shows part of an image capture device comprising an example of a movement detection device with a thresholding algorithm per envelope.

Identical, similar or equivalent parts of the various figures described below have the same numerical references so as to facilitate the passage from one figure to another.

The different parts shown in the figures are not necessarily to a uniform scale, to make the figures easier to read.

The different possibilities (variants and embodiments) should be understood as not being mutually exclusive and may be combined with one another.

DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS

A movement detection device 100 and method with a thresholding algorithm per envelope, according to one specific embodiment will now be described in relation to FIG. 2.

A first step of this method is to estimate the background of the images in which a movement is to be detected, wherein the background is formed by the fixed elements in the captured images. For this purpose, firstly, using means 102, a first recursive average M1 _(n) is calculated wherein an important weighting coefficient 1/N₁ of a signal S_(n) corresponding to the signal supplied by a pixel, or a group of pixels also called macropixel, of an n-th acquired image. Wherein:

${{M\; 1_{n}} = {{M\; 1_{n - 1}} - {\frac{1}{N_{1}}M\; 1_{n - 1}} + {\frac{1}{N_{1}}S_{n}}}},$

In this calculation of the first mean M1 _(n), the choice of the value of the weighting coefficient 1/N₁ is important so that only the fixed elements in the acquired images are conserved. For an image capture device operating at 25 Hz, for example a weighting coefficient such as 1/N₁=1/(2⁷ is chosen. The value of the weighting coefficient 1/N₁ is chosen in function of the amplitude and the frequency of the variations of the signal S_(n).

Consequently, the value M1 _(n) calculated for a pixel or a macropixel corresponds to the luminous intensity emitted by the fixed element captured by this pixel or this macropixel, even if one or several moving elements temporarily pass before this pixel or this macropixel during the movement detection.

In one variant of this embodiment, the first mean M1 _(n) may not be a recursive average, but a sigma-delta mean, for example with a low level of incrementation and decrementation c₁ (for example equal to 1), also permitting the estimation of the background to be calculated. A similar effect may be obtained by choosing a low refresh period. This low level of incrementation and decrementation corresponds to an important time constant in a recursive mean calculation. For this purpose, firstly the initialisation M1 ₀=S₀ is carried out. For the following images, which is to say for n>0, M1 _(n-1) and S_(n) are compared. If M1 _(n-1)<S_(n), then the value of M1 _(n-1) is incremented such that M1 _(n)=M1 _(n-1)+c₁. If M1 _(n-1)>S_(n), then the value of M1 _(n-1) is decremented such that M1 _(n)=M1 _(n-1)−c₁.

Then the signal Δ_(n)=|M1 _(n)−S_(n)| is calculated using a subtractor 104 and absolute value calculation means 106.

Then a second sigma-delta mean M2 _(n), with a constant level of incrementation and decrementation c₂ (for example equal to 1) of the signal Δ_(n) is calculated using calculating means 108.

To calculate this second mean M2 _(n), firstly the initialisation M2 ₀=Δ₀ is carried out. For the following images, which is to say for n>0, M2 _(n-1) and Δ_(n) are compared. If M2 _(n-1)<Δ_(n), then the value of M2 _(n-1) is incremented such that M2 _(n)=M2 _(n-1)+c₂. If M2 _(n-1)>Δ_(n), then the value of M2 _(n-1) is decremented such that M2 _(n)=M2 _(n-1)−c₂.

It is also possible that this second mean M2 _(n) is not a sigma-delta type mean, but a recursive type mean. In this case, the calculation means 108 calculate the second recursive mean M2 _(n) with a high time constant 1/N₂, of the signal Δ_(n). This second recursive mean M2 _(n) is obtained with the following calculation:

${M\; 2_{n}} = {{M\; 2_{n - 1}} - {\frac{1}{N_{2}}M\; 2_{n - 1}} + {\frac{1}{N_{2}}\Delta_{n}}}$

The weighting coefficient 1/N₂ is chosen in function of the amplitude and the frequency of the variations of the envelope signal Δ_(n). For example N₂=2⁶.

Then the signal S_(n)−k₁·M2 _(n) is calculated using a subtracter 110 and a multiplier 111. In this embodiment, the value of k₁ is equal to 1.

The device 100 also comprises means 114 of calculating a third recursive mean M3 _(n). This third recursive mean M3 _(n) is obtained using the following calculation:

${M\; 3_{n}} = {{M\; 3_{n - 1}} - {\frac{1}{N_{3}}M\; 3_{n - 1}} + {\frac{1}{N_{3}}\left( {S_{n} - {k_{1} \cdot 2_{n}}} \right)}}$

The weighting coefficient 1/N₃ is chosen in function of the amplitude and the frequency of the variations of the signal (S_(n)−k₁·M2 _(n)). For example N₃=2⁶.

This third mean M3 _(n) may also be obtained by calculating the delta-sigma mean of the signal (S_(n)−k₁·M2 _(n)) with an incrementation constant c₃.

Then the signal S_(n)+k₂·M2 is calculated using an adder 112 and a multiplier 113. In this embodiment, the value of k₁ is equal to 1.

Then, calculating means 116 permit a fourth recursive mean M4 _(n) to be calculated. This fourth recursive mean M4 _(n) is obtained by the following calculation:

${M\; 4_{n}} = {{M\; 4_{n - 1}} - {\frac{1}{N_{4}}M\; 4_{n - 1}} + {\frac{1}{N_{4}}\left( {S_{n} + {{k_{2} \cdot M}\; 2_{n}}} \right)}}$

The time constant 1/N₄ is chosen in function of the amplitude and the frequency of the variations of the signal (S_(n)+k₂·M2 _(n)). For example N₄=26.

It is possible that the values of 1/N₃ and/or 1/N₄ are constant throughout the movement detection method. It is also possible that one or both of these two values vary during the movement detection method in function of the value of |M3 _(n)−S_(n)| for M3 _(n) and |M4 _(n)−S_(n)| for M4 _(n). Consequently, a time constant 1/N₃ may be chosen that is more rapid when M3 _(n)>S_(n), or even a time constant 1/N₄ that is slower when S_(n)>M4 _(n).

In one variant, the third mean and/or the fourth mean may also be of the sigma-delta type, with incrementation and decrementation constants c₃ and c₄.

Preferably, a third mean M3 _(n) and a fourth mean M4 _(n) of the recursive types will be chosen.

Finally, to determine the presence or absence of movements in the captured image n, the device 100 comprises two comparators 122 and 124 which make a comparison of the signals (M3 _(n)−M2 _(n)), obtained by a subtractor 118, and S_(n), and of the signals (M4 _(n)+M2 _(n)), obtained by an adder 120, and S_(n), wherein a movement is considered as detected when S_(n)>(M4 _(n)+M2 _(n)) or S_(n)<(M3 _(n)−M2 _(n)).

In one variant, it is also possible that the presence or absence of movements in the captured image n is determined by comparing the signals (M4 _(n)+M2 _(n)) and (M3 _(n)−M2 _(n)) not with S_(n) but with a fifth recursive type mean M5 _(n) of this signal S_(n). This fifth recursive type mean M5 _(n) is obtained by the following calculation:

${M\; 5_{n}} = {{M\; 5_{n - 1}} - {\frac{1}{N_{5}}M\; 5_{n - 1}} + {\frac{1}{N_{5}}S_{n}}}$

The weighting coefficient 1/N₅ used for this calculation is preferably rapid (for example N₅=2⁶). The weighting coefficient 1/N₅ is chosen in function of the amplitude and the frequency of the variations of the signal S_(n). In this case, the device 100 comprises means of calculating this fifth mean, not shown, of which the output is sent to the input of the comparators 122 and 124 instead of the signal S_(n).

This method is based on the generation of an envelope whose upper and lower values form threshold values which permit the presence or absence of movement to be determined. The thresholding of the variations detected is therefore adaptive.

In general, the incrementation and decrementation values c₁ and/or c₂ and/or the time constants 1/N₁, 1/N₂, 1/N₃, 1/N₄ and 1/N₅ used in the means calculations are adapted in function of the pixel resolution of the captured images, which is to say the number of levels of grey onto which the processed signal is encoded, as well as the operating frequency of the movement detection device 100.

FIG. 3 shows an example of a signal S_(n) from several images captured by a pixel matrix as well as the different signals calculated during a movement detection method with a thresholding algorithm per envelope as previously described.

In this FIG. 3, the x axis shows the evolution of the signals, graduated in the number of captured images, and the y axis shows the value of these signals graduated in the levels of grey. The curve 130 shows the signal S_(n) obtained at the output of a pixel or a macropixel. It is this signal that is sent to the input of the device 100. The curve 132 shows the first mean M1 _(n), in this case recursive, obtained at the output of the calculation means 102. This first mean M1 _(n) shows the background of the image captured, which is to say the fixed element(s) captured by the pixel or the group of pixels. In FIG. 3, it can be seen that this first mean M1 _(n) varies very little, which effectively corresponds to the value of the fixed elements captured. The curve 134 shows the signal Δ_(n). It may be seen in FIG. 3 that this signal Δ_(n) follows the most significant variations of the output signal S_(n) according to the curve 130, thus creating an estimation of the variations, which is to say of the moving elements in the captured images. Finally, the curves 136, 138 and 140 respectively show the signals M2 _(n), M3 _(n) and M4 _(n). The curves 138 and 140 show the upper and lower boundaries of the thresholding envelope calculated around the signal S_(n). Consequently, by correctly choosing the value of the weighting coefficient for the calculation of the second mean M2 _(n), the high frequency parasite movements corresponding to the low variations recorded by the image capture device are not considered as detected movements.

One example of an image capture device 200, or optical imaging device, permitting a movement detection method with a thresholding algorithm per envelope previously described to be implemented is shown in FIG. 4.

The image capture device 200 comprises pixel matrix 202 and a movement detection device 204. Each pixel of the matrix 202 is here formed by a photodiode and addressing and reading transistors. The movement detection method with a thresholding algorithm per envelope previously described may be applied to the signal S_(n) supplied by a pixel, by connecting a movement detection device similar to the device 204 to each column of pixels of the matrix 202. It is also possible that the movement detection method is applied to a signal S_(n) corresponding to the signals supplied by several pixels, for example the mean of these signals. Consequently, by considering the macropixels, it is possible to operate the image capture device 200 in low resolution zones, and only to detail these zones by using a movement detection method with a thresholding algorithm per envelope for each pixel of a macropixel when a movement is detected on this macropixel. It is therefore possible to reduce the number of movement detection devices 204 used in the image capture device 200 by only using a single movement detection device 204 per column of macropixels. A macropixel may for example be a square of 12×12 pixels, or any other value, for example 4×4 pixels as in FIG. 4. The values of each macropixel of the matrix 202 are read line by line.

The movement detection devices 204 shown in FIG. 4 comprises a comparator 206, for example an operational amplifier (or transconductance amplifier), a plurality of switched capacities 208, analogue memory registers 210 (four memory registers 210 are shown in FIG. 4 but the movement detection device 204 may comprise a different number of memory registers adapted to the number of values to be stored while the movement detection method is in use), an address demultiplexer 212 a, an address multiplexer 212 b, a multiplexer 214 for controlling the writing in the switched capacities 208, a multiplexer 216 supplying the values to be written in the switched capacities 208, a SRAM memory 218, and a capacitor 222.

The operation of the movement detection device 204 will now be described in relation to the implementation of the movement detection method previously described.

In the case of a first mean M1 _(n) of the recursive type, the value of the signal M_(n-1) stored in one of the memory registers 210 is supplied to the input of the multiplexer 216, by means of the address multiplexer 212 b. When n=0, M⁻¹=0. The first recursive mean M1 _(n) is then calculated. For this purpose, the signal M_(n-1) is sent to the terminals of a first switched capacity 208 whose value is equal to (N₁₋1)/N₁. The value of the signal M_(n-1) is stored at the terminals of this capacity.

The signal S_(n) supplied by the first macropixel of the matrix 202 is then supplied to the input of the multiplexer 216. The value of the signal S_(n) is stored at the terminals of a second switched capacity whose value C₄ is equal to 1/N₁.

By connecting in parallel the two switched capacities, the signal

${M\; 1_{n}} = {{M\; 1_{n - 1}} - {\frac{1}{N_{1}}M\; 1_{n - 1}} + {\frac{1}{N_{1}}S_{n}}}$ is obtained at the terminals of these capacities.

It is also possible that the mean M1 _(n) is a sigma-delta mean. For this purpose, the initialisation M1 ₀=S₀ is carried out by storing the value of the signal S₀ in one of the memory registers 210. For the following images, M1 _(n-1) and S_(n) are compared by applying one of the two signals to the positive input of the comparator 206 by means of the capacitor 222 in which this signal is stored, and by applying the other of the two signals to the negative input of the comparator 206. The result obtained at the output of the comparator 206 permits one of the values +c₁ or −c₁ applied to the input of the multiplexer 216 (+c and −c₁ in FIG. 4) to be selected. If M1 _(n-1)<S_(n), then the value of M1 _(n-1) is incremented such that M1 _(n)=M1 _(n-1)+c₁. If M1 _(n-1)>S_(n), then the value of M1 _(n-1) is decremented such that M1 _(n)=M1 _(n-1)−c₁. In this embodiment, c₁=1. The addition operation of +/−c₁ to M1 _(n-1) is carried out by means of the capacities 208 by storing at the terminals two of these capacities the +/−c₁ and M1 _(n-1) values, and by connecting these capacities in series so as to carry out an addition.

Whether the mean M1 _(n) is of the recursive or sigma-delta type, its value is stored in one of the memory registers 210. In this embodiment, the movement detection device 204 comprises four memory registers 210 designed to store four different means M1 _(n), M2 _(n), M3 _(n) and M4 _(n).

The signal Δ_(n)=|M1 _(n)−S_(n)| is then calculated. This operation may be carried out by the switched capacities 208.

In a similar manner to the calculation of the first mean M1 _(n) when the latter is of the recursive type, the calculation of the second recursive type or sigma-delta mean M2 _(n) is carried out. When M2 _(n) is of the recursive type, then two other switched capacities 208 are used respectively of values (N₂−1)/N₂ and 1/N₂. When the second mean M2 _(n) is of the sigma-delta type, this second mean is calculated in a similar manner to the calculation of the first mean M1 _(n), using two values +c₂ and −c₂ applied to the input of the multiplexer 216 instead of the values +c₁ and −c₁.

Then the calculation (S_(n)−k₁·M2 _(n)) is carried out by the switched capacities 208, then that of the third mean M3 _(n) of this signal. Finally, the signal (S_(n)+k₂·M2 _(n)) and that of the fourth mean M4 _(n) of this signal are calculated.

A comparison is then made using the amplifier 206 of the signal S_(n) and the signal (M3 _(n)−M2 _(n)). The value obtained at the output of the amplifier 206 is representative of a detection or non-detection of a movement on the macropixel considered. If S_(n)<(M3 _(n)−M2 _(n)), then it is considered that a movement has been detected on the macropixel considered.

Next, a comparison is made using the amplifier 206 of the signal S_(n) and the signal (M4 _(n)+M2 _(n)). The value obtained at the output of the amplifier 206 is representative of a detection or non detection of a movement on the macropixel considered. If S_(n)>(M4 _(n)+M2 _(n)), then it is considered that a movement has been detected on the macropixel considered.

The operation is then repeated for the following macropixels, line after line.

In one variant, the comparison of the signal S_(n) and the signal (M3 _(n)−M2 _(n)) may be replaced by a comparison of a fifth recursive type mean M5 _(n) of this signal S_(n) where the signal (M3 _(n)−M2 _(n)). The value obtained at the output of the amplifier 206 is representative of a detection or non-detection of a movement on the macropixel considered. If M5 _(n)<(M3 _(n)−M2 _(n)), then it is considered that a movement has been detected on the macropixel considered. This fifth recursive mean M5 _(n) is obtained by the following calculation:

${M\; 5_{n}} = {{M\; 5_{n - 1}} - {\frac{1}{N_{5}}M\; 5_{n - 1}} + {\frac{1}{N_{5}}S_{n}}}$

This calculation may be carried out by the switched capacities of value (N₅−1)/N₅ and 1/N₅.

In the same way, the comparison of S_(n) and the signal (M4 _(n)+M2 _(n)) may be replaced by a comparison of M5 _(n) and (M4 _(n)+M2 _(n)). If M5 _(n)>(M4 _(n)+M2 _(n)), then it is considered that a movement has been detected on the macropixel considered.

For the mean M2 _(n), a non-null minimum threshold value may be imposed, below which this mean is not allowed to descend. This minimum threshold value S_(M2n) may be applied to the input of the multiplexer 216. When the value of this mean is below this threshold value, this value is then replaced by the threshold value. For example, in this embodiment, the value of S_(M2n) may be equal to about 1/50×the dynamic of S_(n).

When a movement is detected on the macropixel, it is possible, for an image n for which the movement detection has been carried out on macropixels, to store the values of the macropixels in the memory 218, then, on the macropixel(s) where movements are recorded, to implement the movement detection methods previously described for each of the pixels of the macropixel. Consequently, the location of the movements detected may be defined precisely, without processing all of the pixels of the captured images.

It may be seen that the method may be implemented using few hardware calculation (an operational amplifier, several switched capacities with a clock frequency for the instructions of several tens of kHz and several multiplexers/demultiplexers) and memory resources (several analogue registers per pixel and a SRAM memory for example).

The device shown in FIG. 4 permits an analogue implementation of the movement detection method previously described. However, it is also possible to use a digital implementation of the movement detection methods by connecting the pixel matrix 202 to signal digital processing means, for example a circuit of the DSP or FPGA type or a microprocessor, wherein the movement detection method is programmed.

The signals obtained at the output of the movement detection devices may be used to display an image on which the background captured forms a black background onto which the moving elements detected are shown in white, for example as shown on the image on the right in FIG. 4. 

1. A movement detection method comprising at least the following steps: the calculation of a first mean M1 _(n) of a signal S_(n) designed to be supplied by at least one pixel of a pixel matrix which corresponds to an n-th captured image, in function of the value of the signal S_(n) and/or a previous value M1 _(n-1); the calculation of a signal Δ_(n)=|M1 _(n)−S_(n)|; the calculation of a second mean M2 _(n) of the signal Δ_(n) in function of a previous value M2 _(n-1) and/or the value of the signal Δ_(n); the calculation of a third mean M3 _(n) of the signal (S_(n)−k₁·M2 _(n)) in function of a previous value M3 _(n-1) and/or the value of the signal (S_(n)−k₁·M2 _(n)); the calculation of a fourth mean M4 _(n) of the signal (S_(n)+k₂·M2 _(n)) in function of a previous value M4 _(n-1) and/or the value of the signal (S_(n)+k₂·M2 _(n)); detecting a movement from the result of at least one comparison made of the signals S_(n), (M3 _(n)−M2 _(n)) and (M4 _(n)+M2 _(n)); where n: natural whole number; and k₁ and k₂: non-null positive real numbers.
 2. The method according to claim 1, wherein the first mean M1 _(n) is obtained from the following equation: ${{M\; 1_{n}} = {{M\; 1_{n - 1}} - {\frac{1}{N_{1}}M\; 1_{n - 1}} + {\frac{1}{N_{1}}S_{n}}}},$ where M1 ⁻¹=0, and 1/N₁: non-null positive real number.
 3. The method according to claim 1, wherein the first mean M1 _(n) is obtained at least by the following calculation steps: M1 ₀=S₀; and for n>0: M1 _(n)=M1 _(n-1)+c₁ when M1 _(n-1)<S_(n); M1 _(n)=M1 _(n-1)−c₁ when M1 _(n-1)>S_(n); where c₁: non-null positive real number.
 4. The method according to claim 1, wherein the second mean M2 _(n) is obtained from the following equation: ${{M\; 2_{n}} = {{M\; 2_{n - 1}} - {\frac{1}{N_{2}}M\; 2_{n - 1}} + {\frac{1}{N_{2}}\Delta_{n}}}},$ where M2 ⁻¹=0, and 1/N₂: non-null positive real number.
 5. The method according to claim 1, wherein the second mean M2 _(n) is obtained at least by the following calculation steps: M2 ₀=Δ₀; and for n>0: M2 _(n)=M2 _(n-1)+c₂ when M2 _(n-1)<Δ_(n); M2 _(n)=M2 _(n-1)−c₂ when M2 _(n-1)>Δ_(n); where c₂: non-null positive real number.
 6. The method according to claim 1, wherein the third mean M3 _(n) is obtained from the following equation: ${{M\; 3_{n}} = {{M\; 3_{n - 1}} - {\frac{1}{N_{3}}M\; 3_{n - 1}} + {\frac{1}{N_{3}}\left( {S_{n} - {{k_{1} \cdot M}\; 2_{n}}} \right)}}},$ where M3 ⁻¹=0, and 1/N₃: non-null positive real number.
 7. The method according to claim 6, wherein the value of 1/N₃ is adjusted in function of the value |M3 _(n)−S_(n)|: when M3 _(n)<S_(n), the value of 1/N₃ verify the relation: period (S_(n))/ln(1−1/N₃)−¹>1 s; when M3 _(n)>S_(n), the value of 1/N₃ verify the relation: period (S_(n))/ln(1−1/N₃)⁻¹<0.5 s.
 8. The method according to claim 1, wherein the third mean M3 _(n) is obtained at least by the following calculation steps: M3 ₀=(S₀−k₁·M2 ₀) and for n>0: M3 _(n)=M3 _(n-1)+c₃ when M3 _(n-1)<(S_(n)−k₁·M2 _(n)); M3 _(n)=M3 _(n-1)−c₃ when M3 _(n-1)>(S_(n)−k₁·M2 _(n)) where c₃: non-null positive real number.
 9. The method according to claim 1, wherein the fourth mean M4 _(n) is obtained from the following equation: ${{M\; 4_{n}} = {{M\; 4_{n - 1}} - {\frac{1}{N_{4}}M\; 4_{n - 1}} + {\frac{1}{N_{4}}\left( {S_{n} + {{k_{2} \cdot M}\; 2_{n}}} \right)}}},$ where M4 ⁻¹=0, and 1/N₄: non-null positive real number.
 10. The method according to claim 9, wherein the value of 1/N₄ is adjusted in function of the value |M4 _(n)−S_(n)|: when M4 _(n)<S_(n), the value of 1/N₄ verify the relation: period (S_(n))/ln(1−1/N₄)−¹<0.5 s; when M4 _(n)>S_(n), the value of 1/N₄ verify the relation: period (S_(n))/ln(1−1/N₄)⁻¹>1 s.
 11. The method according to claim 1, wherein the fourth mean M4 _(n) is obtained at least by the following calculation steps: M4 ₀=(S₀+k₂·M2 ₀) and for n>0: M4 _(n)=M4 _(n-1)+c₄ when M4 _(n-1)<(S_(n)+k₂·M2 _(n)); M4 _(n)=M4 _(n-1)−c₄ when M4 _(n-1)>(S_(n)+k₂·M2 _(n)); where c₄: non-null positive real number.
 12. The method according to claim 1, wherein the value of the second mean M2 _(n) is greater than a second non-null minimum threshold value S_(M2n).
 13. The method according to claim 12, the value of S_(M2n) is comprised between approximately 1/250×the dynamic of the signal S_(n) and 1/25×the dynamic of the signal S_(n).
 14. The method according to claim 1, wherein said comparison is made of the signals S_(n) and (M3 _(n)−M2 _(n)) and of the signals S_(n) and (M4 _(n)+M2 _(n)), wherein a movement is considered as detected when S_(n)>(M4 _(n)+M2 _(n)) or S_(n)<(M3 _(n)−M2 _(n)).
 15. The method according to claim 1, further comprising, between the calculation step of the fourth mean M4 _(n) of the signal (S_(n)+M2 _(n)) and the comparison step, a calculation step of a fifth mean M5 _(n) of the signal S_(n) in function of a previous value M5 _(n-1) and/or the value of the signal S_(n), wherein said comparison is made on the signals M5 _(n) and (M3 _(n)−M2 _(n)) and on the signals M5 _(n) and (M4 _(n)+M2 _(n)), wherein a movement is considered as detected when M5 _(n)>(M4 _(n)+M2 _(n)) or M5 _(n)<(M3 _(n)−M2 _(n)).
 16. The method according to claim 15, wherein the fifth mean M5 _(n) is obtained from the following equation: ${{M\; 5_{n}} = {{M\; 5_{n - 1}} - {\frac{1}{N_{5}}M\; 5_{n - 1}} + {\frac{1}{N_{5}}S_{n}}}},$ where M5 ⁻¹=0, and 1/N₅: non-null positive real number.
 17. A movement detection device at least comprising: means of calculating a first mean M1 _(n) of a signal S_(n) designed to be supplied by at least one pixel of a pixel matrix and corresponding to a n-th captured image, in function of the value of the signal S_(n) and/or a previous value M1 _(n-1); means of calculating a signal Δ_(n)=|M1 _(n)−S_(n)|; means of calculating a second mean M2 _(n) of the signal Δ_(n) in function of a previous value M2 _(n-1) and/or the value of the signal Δ_(n); means of calculating a third mean M3 _(n) of the signal (S_(n)−k₁·M2 _(n)) in function of a previous value M3 _(n-1) and/or the value of the signal (S_(n)−k₁·M2 _(n)); means of calculating a fourth mean M4 _(n) of the signal (S_(n)+k₂·M2 _(n)) in function of a previous value M4 _(n-1) and/or the value of the signal (S_(n)+k₂·M2 _(n)); wherein a movement is detected from the result obtained at the output of a means of comparison which make at least one comparison of the signals S_(n), (M3 _(n)−M2 _(n)) and (M4 _(n)+M2 _(n)) where n: natural whole number; and k₁ and k₂: non-null positive real numbers.
 18. The device according to claim 17, wherein the means of calculating the first mean M1 _(n) carry out at least the following operation: ${{M\; 1_{n}} = {{M\; 1_{n - 1}} - {\frac{1}{N_{1}}M\; 1_{n - 1}} + {\frac{1}{N_{1}}S_{n}}}},$ where M1 ⁻¹=0, and 1/N₁: non-null positive real number.
 19. The device according to claim 17, wherein the means of calculating the first mean M1 _(n) at least comprise: means of initialising the value of M1 ₀ to the value of S₀; means of comparing the value of the signal M1 _(n-1) and the value of the signal S_(n); means of incrementing and decrementing the value of M1 _(n) by a constant c₁, where c₁: non-null positive real number.
 20. The device according to claim 17, wherein the means of calculating the second mean M2 _(n) carry out at least the following operation: ${{M\; 2_{n}} = {{M\; 2_{n - 1}} - {\frac{1}{N_{2}}M\; 2_{n - 1}} + {\frac{1}{N_{2}}\Delta_{n}}}},$ where M2 ⁻¹=0, and 1/N₂: non-null positive real number.
 21. The device according to claim 17, wherein the means of calculating the second mean M2 _(n) at least comprise: means of initialising the value of M2 ₀ to the value of Δ₀; means of comparing the value of the signal M2 _(n-1) and the value of the signal Δ_(n); means of incrementing and decrementing the value of M2 _(n) by a constant c₂, where c₂: non-null positive real number.
 22. The device according to claim 17, wherein the means of calculating the third mean M3 _(n) carry out at least the following operation: ${{M\; 3_{n}} = {{M\; 3_{n - 1}} - {\frac{1}{N_{3}}M\; 3_{n - 1}} + {\frac{1}{N_{3}}\left( {S_{n} - {{k_{1} \cdot M}\; 2_{n}}} \right)}}},$ where M3 ⁻¹=0, and 1/N₃: positive real number.
 23. The device according to claim 22, wherein the means of calculating the third mean M3 _(n) further comprise means of adjusting the value of 1/N₃ in function of the value |M3 _(n)−S_(n)| such that: when M3 _(n)<S_(n), the value of 1/N₃ verify the relation: period (S_(n))/ln(1−1/N₃)−¹>1 s; when M3 _(n)>S_(n), the value of 1/N₃ verify the relation: period (S_(n))/ln(1−1/N₃)⁻¹<0.5 s.
 24. The device according to claim 17, wherein the means of calculating the third mean M3 _(n) at least comprise: means of initialising the value of M3 ₀ to the value of (S₀−k₁·M2 ₀); means of comparing the value of the signal M3 _(n-1) and the value of the signal (S_(n)−k₁·M2 _(n)); means of incrementing and decrementing the value of M3 _(n) by a constant c₃, where c₃: non-null positive real number.
 25. The device according to claim 17, wherein the means of calculating the fourth mean M4 _(n) carry out at least the following operation: ${{M\; 4_{n}} = {{M\; 4_{n - 1}} - {\frac{1}{N_{4}}M\; 4_{n - 1}} + {\frac{1}{N_{4}}\left( {S_{n} + {{k_{2} \cdot M}\; 2_{n}}} \right)}}},$ where M4 ⁻¹=0, and 1/N₄: non-null positive real number.
 26. The device according to claim 25, wherein the means of calculating the fourth mean M4 _(n) further comprise means of adjusting the value of 1/N₄ in function of the value |M4 _(n)−S_(n)| such that: when M4 _(n)<S_(n), the value of 1/N₄ verify the relation: period (S_(n))/ln(1−1/N₄)−¹<0.5 s; when M4 _(n)>S_(n), the value of 1/N₄ verify the relation: period (S_(n))/ln(1−1/N₄)⁻¹>1 s.
 27. The device according to claim 17, wherein the means of calculating the fourth mean M4 _(n) at least comprise: means of initialising the value of M4 ₀ to the value of (S₀+k₂·M2 ₀); means of comparing the value of the signal M4 _(n-1) and the value of the signal (S_(n)+k₂·M2 _(n)); means of incrementing and decrementing the value of M4 _(n) by a constant c₄, where c₄: non-null positive real number.
 28. The device according to claim 17, wherein the means of comparison are means of comparing the signals S_(n) and (M3 _(n)−M2 _(n)) and means of comparing the signals S_(n) and (M4 _(n)+M2 _(n)), wherein a movement is considered as detected when S_(n)>(M4 _(n)+M2 _(n)) or S_(n)<(M3 _(n)−M2 _(n)).
 29. The device according to claim 17, further comprising means of calculating a fifth mean M5 _(n) of the signal S_(n) in function of a previous value M5 _(n-1) and/or the value of the signal S_(n), wherein the means of comparison are means of comparing the signals M5 _(n) and (M3 _(n)−M2 _(n)) and means of comparing the signals M5 _(n) and (M4 _(n)+M2 _(n)), wherein a movement is considered as detected when M5 _(n)>(M4 _(n)+M2 _(n)) or M5 _(n)<(M3 _(n)−M2 _(n)).
 30. The device according to claim 29, wherein the means of calculating the fifth mean M5 _(n) carry out at least the following operation: ${{M\; 5_{n}} = {{M\; 5_{n - 1}} - {\frac{1}{N_{5}}M\; 5_{n - 1}} + {\frac{1}{N_{5}}S_{n}}}},$ where M5 ⁻¹=0, and 1/N₅: non-null positive real number.
 31. An image capture device comprising at least one pixel matrix and one movement detection device according to claim
 17. 